On constant composition codes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On constant-composition codes over Zq

A constant-composition code is a special constant-weight code under the restriction that each symbol should appear a given number of times in each codeword. In this correspondence, we give a lower bound for the maximum size of the -ary constant-composition codes with minimum distance at least 3. This bound is asymptotically optimal and generalizes the Graham–Sloane bound for binary constant-wei...

متن کامل

Constant composition codes derived from linear codes

In this paper, we propose a class of linear codes and obtain their weight distribution. Some of these codes are almost optimal. Moreover, several classes of constant composition codes(CCCs) are constructed as subcodes of linear codes.

متن کامل

Optimal linear codes, constant-weight codes and constant-composition codes over $\Bbb F_{q}$

Optimal linear codes and constant-weight codes play very important roles in coding theory and have attached a lot of attention. In this paper, we mainly present some optimal linear codes and some optimal constant-weight codes derived from the linear codes. Firstly, we give a construction of linear codes from trace and norm functions. In some cases, its weight distribution is completely determin...

متن کامل

Some Unique Ternary Constant-composition Codes

The uniqueness of some ternary constant-composition codes is proved by combinato-rial methods. 1. Introduction. For all basic notions and facts about coding theory which are not introduced here we refer to [3]. All codes to be considered are ternary constant-composition codes. Ternary constant-composition (TCC) codes of length n are codes with constant composition of " zeros " , " ones " and " ...

متن کامل

A Construction of Optimal Constant Composition Codes

In this paper, a construction of optimal constant composition codes is developed, and used to derive some series of new optimal constant composition codes meeting the upper bound given by [13].

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2006

ISSN: 0166-218X

DOI: 10.1016/j.dam.2005.09.009